Peephole Partial Order Reduction
نویسندگان
چکیده
We present a symbolic dynamic partial order reduction (POR) method for model checking concurrent software. We introduce the notion of guarded independent transitions, i.e., transitions that can be considered as independent in certain (but not necessarily all) execution paths. These can be exploited by using a new peephole reduction method. A symbolic formulation of the proposed peephole reduction adds concise constraints to allow automatic pruning of redundant interleavings in an SMT/SAT solver based search. Our new method does not directly correspond to any explicit-state algorithm in the literature, e.g., those based on persistent sets. For two threads, our symbolic method guarantees the removal of all redundant interleavings (better than the smallest persistent-set based methods). To our knowledge, this type of reduction has not been achieved by other symbolic methods.
منابع مشابه
Peephole Superoptimization a Dissertation Submitted to the Department of Electrical Engineering and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
متن کامل
Precondition Inference for Peephole Optimizations in LLVM
Peephole optimizations are a common source of compiler bugs. Compiler developers typically transform an incorrect peephole optimization into a valid one by strengthening the precondition. This process is challenging and tedious. This paper proposes ALIVE-INFER, a data-driven approach that infers preconditions for peephole optimizations expressed in Alive. ALIVE-INFER generates positive and nega...
متن کاملPeephole Optimization of Asynchronous Networks Through Process Composition and Burst mode Machine Generation
In this paper we discuss the problem of improving the e ciency of macromodule networks generated through asynchronous high level synthesis We compose the behaviors of the modules in the sub network being optimized using Dill s trace theoretic operators to get a single behavioral description for the whole sub network From the composite trace structures so obtained we obtain interface state graph...
متن کاملPeek: A Formally Verified Peephole Optimization Framework for x86
Peek is a first step toward adding support for assembly-level program analyses, transformations, and optimizations in CompCert. Currently, Peek focuses on x86 peephole transformations implemented and verified in Coq. Peek is designed to provide a modular interface requiring that each peephole optimization satisfy only local correctness properties. Our primary result establishes that, assuming t...
متن کاملFormal Veri cation of Transformations forPeephole Optimization ?
In this paper we describe a formal veriication of transformations for peephole optimization using the PVS system 12]. Our basic approach is to develop a generic scheme to mechanize these kinds of veri-cations for a large class of machine architectures. This generic scheme is instantiated with a formalization of a non-trivial stack machine 14] and a PDP-11 like two-address machine 2], and we pro...
متن کامل